Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
نویسندگان
چکیده
منابع مشابه
Scaled Dimension and the Berman-Hartmanis Conjecture
In 1977, L. Berman and J. Hartmanis [BH77] conjectured that all polynomialtime many-one complete sets for NP are are pairwise polynomially isomorphic. It was stated as an open problem in [LM99] to resolve this conjecture under the measure hypothesis from quantitative complexity theory. In this paper we study the polynomial-time isomorphism degrees within degm(SAT ) in the context of polynomial ...
متن کاملResolution of Hartmanis' Conjecture for NL-Hard Sparse Sets
We resolve a conjecture of Hartmanis from 1978 about sparse hard sets for nonde-terministic logspace (NL). We show that there exists a sparse hard set S for NL under logspace many-one reductions if and only if NL = L (deterministic logspace).
متن کاملSparse Hard Sets for P: Resolution of a Conjecture of Hartmanis
Building on a recent breakthrough by Ogihara, we resolve a conjecture made by Hartmanis in 1978 regarding the (non-) existence of sparse sets complete for P under logspace many-one reductions. We show that if there exists a sparse hard set for P under logspace many-one reductions, then P = LOGSPACE. We further prove that if P has a sparse hard set under many-one reductions computable in NC1, th...
متن کاملthe innovation of a statistical model to estimate dependable rainfall (dr) and develop it for determination and classification of drought and wet years of iran
آب حاصل از بارش منبع تأمین نیازهای بی شمار جانداران به ویژه انسان است و هرگونه کاهش در کم و کیف آن مستقیماً حیات موجودات زنده را تحت تأثیر منفی قرار می دهد. نوسان سال به سال بارش از ویژگی های اساسی و بسیار مهم بارش های سالانه ایران محسوب می شود که آثار زیان بار آن در تمام عرصه های اقتصادی، اجتماعی و حتی سیاسی- امنیتی به نحوی منعکس می شود. چون میزان آب ناشی از بارش یکی از مولفه های اصلی برنامه ...
15 صفحه اولThe Resolution of a Hartmanis Conjecture
Building on the recent breakthrough by Ogihara, we resolve a conjecture made by Hartmanis in 1978 regarding the (non) existence of sparse sets complete for P under logspace many-one reductions. We show that if there exists a sparse hard set for P under logspace many-one reductions, then P = LOGSPACE. We further prove that if P has a sparse hard set under many-one reductions computable in NC1, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1982
ISSN: 0022-0000
DOI: 10.1016/0022-0000(82)90002-2